SlideShare a Scribd company logo

computer notes - Data Structures - 3

Download as PPT, PDF
E
ecomputernotes

The document discusses linked lists and C++ code for implementing them. It describes how a linked list is structured in memory using nodes that point to the next node. It also shows the Node class definition used to create nodes, and the List class with methods like add() to insert new nodes into the linked list.

Technology
1 of 46
Download to read offline
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
Class No.03 Data Structures http://ecomputernotes.com
Linked List Actual picture in memory: 1051 1052 1055 1059 1060 1061 1062 1063 1064 1056 1057 1058 1053 1054 2 6 8 7 1 1051 1063 1057 1060 0 head 1054 1063 current 2 6 8 7 1 head current 1065 http://ecomputernotes.com
Linked List Operations add(9): Create a new node in memory to hold ‘9’ Node* newNode = new Node(9); 9 newNode http://ecomputernotes.com
Linked List Operations add(9): Create a new node in memory to hold ‘9’ Node* newNode = new Node(9); Link the new node into the list 9 newNode 2 6 8 7 1 head current size=5 6 9 newNode 1 3 2 http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; }; http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
#include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
Building a Linked List headNode size=0 List list; http://ecomputernotes.com
Building a Linked List headNode 2 headNode currentNode size=1 lastcurrentNode size=0 List list; list.add(2); http://ecomputernotes.com
Building a Linked List headNode 2 headNode currentNode size=1 lastcurrentNode 2 6 headNode currentNode size=2 lastcurrentNode size=0 List list; list.add(2); list.add(6); http://ecomputernotes.com
Building a Linked List List.add(8); list.add(7); list.add(1); 2 6 7 1 headNode currentNode size=5 lastcurrentNode 8 http://ecomputernotes.com
C++ Code for Linked List int get() { if (currentNode != NULL) return currentNode->get(); }; http://ecomputernotes.com
C++ Code for Linked List bool next() { if (currentNode == NULL) return false; lastCurrentNode = currentNode; currentNode = currentNode->getNext(); if (currentNode == NULL || size == 0) return false; else return true; }; http://ecomputernotes.com

More Related Content

PPT
Data structures cs301 power point slides lecture 03
Nasir Mehmood
 
PPT
Whats new in_csharp4
Abed Bukhari
 
PPT
DATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDY
Malikireddy Bramhananda Reddy
 
PPT
20100712-OTcl Command -- Getting Started
Teerawat Issariyakul
 
PDF
Python Performance 101
Ankur Gupta
 
DOCX
Java practical
shweta-sharma99
 
PPT
NS2: Binding C++ and OTcl variables
Teerawat Issariyakul
 
PPSX
What's new in C# 6 - NetPonto Porto 20160116
Paulo Morgado
 
Data structures cs301 power point slides lecture 03
Nasir Mehmood
 
Whats new in_csharp4
Abed Bukhari
 
DATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDY
Malikireddy Bramhananda Reddy
 
20100712-OTcl Command -- Getting Started
Teerawat Issariyakul
 
Python Performance 101
Ankur Gupta
 
Java practical
shweta-sharma99
 
NS2: Binding C++ and OTcl variables
Teerawat Issariyakul
 
What's new in C# 6 - NetPonto Porto 20160116
Paulo Morgado
 

What's hot (18)

PDF
Rainer Grimm, “Functional Programming in C++11”
Platonov Sergey
 
DOC
Final JAVA Practical of BCA SEM-5.
Nishan Barot
 
PDF
Core java pract_sem iii
Niraj Bharambe
 
PDF
Java Practical File Diploma
mustkeem khan
 
PDF
DCN Practical
Niraj Bharambe
 
PDF
DSU C&C++ Practical File Diploma
mustkeem khan
 
DOCX
C# labprograms
Jafar Nesargi
 
PPTX
Poor Man's Functional Programming
Dmitry Buzdin
 
PDF
Refactoring to Macros with Clojure
Dmitry Buzdin
 
PDF
C#
actacademy
 
PPT
Networking Core Concept
Rays Technologies
 
PPTX
Java practice programs for beginners
ishan0019
 
PDF
Bartosz Milewski, “Re-discovering Monads in C++”
Platonov Sergey
 
ZIP
とある断片の超動的言語
Kiyotaka Oku
 
DOCX
Dotnet 18
dhruvesh718
 
PDF
Java practical(baca sem v)
mehul patel
 
PDF
JVM Mechanics: Understanding the JIT's Tricks
Doug Hawkins
 
DOCX
C# console programms
Yasir Khan
 
Rainer Grimm, “Functional Programming in C++11”
Platonov Sergey
 
Final JAVA Practical of BCA SEM-5.
Nishan Barot
 
Core java pract_sem iii
Niraj Bharambe
 
Java Practical File Diploma
mustkeem khan
 
DCN Practical
Niraj Bharambe
 
DSU C&C++ Practical File Diploma
mustkeem khan
 
C# labprograms
Jafar Nesargi
 
Poor Man's Functional Programming
Dmitry Buzdin
 
Refactoring to Macros with Clojure
Dmitry Buzdin
 
C#
actacademy
 
Networking Core Concept
Rays Technologies
 
Java practice programs for beginners
ishan0019
 
Bartosz Milewski, “Re-discovering Monads in C++”
Platonov Sergey
 
とある断片の超動的言語
Kiyotaka Oku
 
Dotnet 18
dhruvesh718
 
Java practical(baca sem v)
mehul patel
 
JVM Mechanics: Understanding the JIT's Tricks
Doug Hawkins
 
C# console programms
Yasir Khan
 
Ad

Viewers also liked (20)

PPT
computer notes - Data Structures - 24
ecomputernotes
 
PPT
computer notes - Data Structures - 11
ecomputernotes
 
PPT
computer notes - Data Structures - 8
ecomputernotes
 
PPT
computer notes - Data Structures - 34
ecomputernotes
 
PPT
computer notes - Data Structures - 32
ecomputernotes
 
PPT
computer notes - Data Structures - 26
ecomputernotes
 
PPT
computer notes - Data Structures - 6
ecomputernotes
 
PPT
computer notes - Data Structures - 21
ecomputernotes
 
PPT
computer notes - Data Structures - 29
ecomputernotes
 
PPT
computer notes - Data Structures - 36
ecomputernotes
 
PPT
computer notes - Data Structures - 37
ecomputernotes
 
PPT
computer notes - Data Structures - 19
ecomputernotes
 
PPT
computer notes - Data Structures - 39
ecomputernotes
 
PPT
computer notes - Data Structures - 25
ecomputernotes
 
PPT
computer notes - Data Structures - 2
ecomputernotes
 
PPT
computer notes - Data Structures - 16
ecomputernotes
 
PPT
computer notes - Data Structures - 7
ecomputernotes
 
PPT
computer notes - Data Structures - 15
ecomputernotes
 
PPT
computer notes - Data Structures - 9
ecomputernotes
 
PPT
computer notes - Data Structures - 5
ecomputernotes
 
computer notes - Data Structures - 24
ecomputernotes
 
computer notes - Data Structures - 11
ecomputernotes
 
computer notes - Data Structures - 8
ecomputernotes
 
computer notes - Data Structures - 34
ecomputernotes
 
computer notes - Data Structures - 32
ecomputernotes
 
computer notes - Data Structures - 26
ecomputernotes
 
computer notes - Data Structures - 6
ecomputernotes
 
computer notes - Data Structures - 21
ecomputernotes
 
computer notes - Data Structures - 29
ecomputernotes
 
computer notes - Data Structures - 36
ecomputernotes
 
computer notes - Data Structures - 37
ecomputernotes
 
computer notes - Data Structures - 19
ecomputernotes
 
computer notes - Data Structures - 39
ecomputernotes
 
computer notes - Data Structures - 25
ecomputernotes
 
computer notes - Data Structures - 2
ecomputernotes
 
computer notes - Data Structures - 16
ecomputernotes
 
computer notes - Data Structures - 7
ecomputernotes
 
computer notes - Data Structures - 15
ecomputernotes
 
computer notes - Data Structures - 9
ecomputernotes
 
computer notes - Data Structures - 5
ecomputernotes
 
Ad

Similar to computer notes - Data Structures - 3 (20)

DOCX
C++ Please write the whole code that is needed for this assignment- wr.docx
BrianGHiNewmanv
 
PDF
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
angelsfashion1
 
PDF
ItemNodeh include ltiostreamgt include ltstring.pdf
acmefit
 
PDF
could you implement this function please, im having issues with it..pdf
feroz544
 
PDF
hi i have to write a java program involving link lists. i have a pro.pdf
archgeetsenterprises
 
PDF
This assignment and the next (#5) involve design and development of a.pdf
EricvtJFraserr
 
PPTX
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
RashidFaridChishti
 
PDF
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
arrowmobile
 
PPT
Doublylinklist
ritu1806
 
PDF
Can you please debug this Thank you in advance! This program is sup.pdf
FashionBoutiquedelhi
 
PDF
Rewrite this code so it can use a generic type instead of integers. .pdf
alphaagenciesindia
 
DOCX
Doubly linklist
ilsamaryum
 
DOCX
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
DIPESH30
 
PDF
So I have this code(StackInAllSocks) and I implemented the method but.pdf
aksahnan
 
PDF
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
fortmdu
 
PPT
C++: Constructor, Copy Constructor and Assignment operator
Jussi Pohjolainen
 
PPTX
Link List Programming Linked List in Cpp
Anil Yadav
 
PDF
pleaase I want manual solution forData Structures and Algorithm An.pdf
wasemanivytreenrco51
 
PDF
How do you stop infinite loop Because I believe that it is making a.pdf
feelinggift
 
PDF
TutorialII_Updated____niceupdateprogram.pdf
BappyAgarwal
 
C++ Please write the whole code that is needed for this assignment- wr.docx
BrianGHiNewmanv
 
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
angelsfashion1
 
ItemNodeh include ltiostreamgt include ltstring.pdf
acmefit
 
could you implement this function please, im having issues with it..pdf
feroz544
 
hi i have to write a java program involving link lists. i have a pro.pdf
archgeetsenterprises
 
This assignment and the next (#5) involve design and development of a.pdf
EricvtJFraserr
 
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
RashidFaridChishti
 
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
arrowmobile
 
Doublylinklist
ritu1806
 
Can you please debug this Thank you in advance! This program is sup.pdf
FashionBoutiquedelhi
 
Rewrite this code so it can use a generic type instead of integers. .pdf
alphaagenciesindia
 
Doubly linklist
ilsamaryum
 
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
DIPESH30
 
So I have this code(StackInAllSocks) and I implemented the method but.pdf
aksahnan
 
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
fortmdu
 
C++: Constructor, Copy Constructor and Assignment operator
Jussi Pohjolainen
 
Link List Programming Linked List in Cpp
Anil Yadav
 
pleaase I want manual solution forData Structures and Algorithm An.pdf
wasemanivytreenrco51
 
How do you stop infinite loop Because I believe that it is making a.pdf
feelinggift
 
TutorialII_Updated____niceupdateprogram.pdf
BappyAgarwal
 

More from ecomputernotes (20)

PPT
computer notes - Data Structures - 30
ecomputernotes
 
PPT
computer notes - Data Structures - 20
ecomputernotes
 
DOC
Computer notes - Including Constraints
ecomputernotes
 
DOC
Computer notes - Date time Functions
ecomputernotes
 
DOC
Computer notes - Subqueries
ecomputernotes
 
DOC
Computer notes - Other Database Objects
ecomputernotes
 
PPT
computer notes - Data Structures - 28
ecomputernotes
 
PPT
computer notes - Data Structures - 31
ecomputernotes
 
PPT
computer notes - Data Structures - 4
ecomputernotes
 
PPT
computer notes - Data Structures - 13
ecomputernotes
 
DOC
Computer notes - Advanced Subqueries
ecomputernotes
 
DOC
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
PPT
computer notes - Data Structures - 22
ecomputernotes
 
PPT
computer notes - Data Structures - 35
ecomputernotes
 
DOC
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
DOC
Computer notes - Manipulating Data
ecomputernotes
 
DOC
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
PPT
computer notes - Data Structures - 14
ecomputernotes
 
PPT
computer notes - Data Structures - 10
ecomputernotes
 
DOC
Computer notes - Controlling User Access
ecomputernotes
 
computer notes - Data Structures - 30
ecomputernotes
 
computer notes - Data Structures - 20
ecomputernotes
 
Computer notes - Including Constraints
ecomputernotes
 
Computer notes - Date time Functions
ecomputernotes
 
Computer notes - Subqueries
ecomputernotes
 
Computer notes - Other Database Objects
ecomputernotes
 
computer notes - Data Structures - 28
ecomputernotes
 
computer notes - Data Structures - 31
ecomputernotes
 
computer notes - Data Structures - 4
ecomputernotes
 
computer notes - Data Structures - 13
ecomputernotes
 
Computer notes - Advanced Subqueries
ecomputernotes
 
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
computer notes - Data Structures - 22
ecomputernotes
 
computer notes - Data Structures - 35
ecomputernotes
 
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
Computer notes - Manipulating Data
ecomputernotes
 
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
computer notes - Data Structures - 14
ecomputernotes
 
computer notes - Data Structures - 10
ecomputernotes
 
Computer notes - Controlling User Access
ecomputernotes
 

Recently uploaded (20)

PDF
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
Jian-Hong Pan
 
PDF
Encapsulation_ Review paper, used for researhc scholars
gurumoop
 
PDF
Spectral efficient network and resource selection model in 5G networks
IAESIJAI
 
PPTX
20250228 LYD VKU AI Blended-Learning.pptx
DatVoNgoc
 
PDF
Chapter 3 Spatial Domain Image Processing.pdf
Getnet Tigabie Askale -(GM)
 
PDF
The Rise and Fall of 3GPP – Time for a Sabbatical?
3G4G
 
PPTX
Cloud computing and distributed systems.
kkkkkhan
 
PPTX
Spectroscopy.pptx food analysis technology
nawahassan45
 
PDF
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
SynapseIndia
 
PDF
Blue Purple Modern Animated Computer Science Presentation.pdf.pdf
Akar16
 
PDF
NewMind AI Weekly Chronicles - August'25 Week I
NewMind AI
 
PPTX
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
blackmambaettijean
 
PDF
Machine learning based COVID-19 study performance prediction
IAESIJAI
 
PDF
Network Security Unit 5.pdf for BCA BBA.
Serpent6
 
PDF
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
Libreria ERP
 
PDF
Encapsulation theory and applications.pdf
gurumoop
 
PPTX
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
ReZa AdineH
 
PDF
Electronic commerce courselecture one. Pdf
OmerMohamed64
 
DOCX
The AUB Centre for AI in Media Proposal.docx
GAONE9
 
PDF
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
Julien SIMON
 
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
Jian-Hong Pan
 
Encapsulation_ Review paper, used for researhc scholars
gurumoop
 
Spectral efficient network and resource selection model in 5G networks
IAESIJAI
 
20250228 LYD VKU AI Blended-Learning.pptx
DatVoNgoc
 
Chapter 3 Spatial Domain Image Processing.pdf
Getnet Tigabie Askale -(GM)
 
The Rise and Fall of 3GPP – Time for a Sabbatical?
3G4G
 
Cloud computing and distributed systems.
kkkkkhan
 
Spectroscopy.pptx food analysis technology
nawahassan45
 
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
SynapseIndia
 
Blue Purple Modern Animated Computer Science Presentation.pdf.pdf
Akar16
 
NewMind AI Weekly Chronicles - August'25 Week I
NewMind AI
 
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
blackmambaettijean
 
Machine learning based COVID-19 study performance prediction
IAESIJAI
 
Network Security Unit 5.pdf for BCA BBA.
Serpent6
 
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
Libreria ERP
 
Encapsulation theory and applications.pdf
gurumoop
 
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
ReZa AdineH
 
Electronic commerce courselecture one. Pdf
OmerMohamed64
 
The AUB Centre for AI in Media Proposal.docx
GAONE9
 
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
Julien SIMON
 

computer notes - Data Structures - 3

  • 1. Class No.03 Data Structures http://ecomputernotes.com
  • 2. Linked List Actual picture in memory: 1051 1052 1055 1059 1060 1061 1062 1063 1064 1056 1057 1058 1053 1054 2 6 8 7 1 1051 1063 1057 1060 0 head 1054 1063 current 2 6 8 7 1 head current 1065 http://ecomputernotes.com
  • 3. Linked List Operations add(9): Create a new node in memory to hold ‘9’ Node* newNode = new Node(9); 9 newNode http://ecomputernotes.com
  • 4. Linked List Operations add(9): Create a new node in memory to hold ‘9’ Node* newNode = new Node(9); Link the new node into the list 9 newNode 2 6 8 7 1 head current size=5 6 9 newNode 1 3 2 http://ecomputernotes.com
  • 5. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; }; http://ecomputernotes.com
  • 6. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 7. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 8. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 9. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 10. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 11. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 12. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 13. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 14. C++ Code for Linked List The Node class class Node { public: int get() { return object; }; void set(int object) { this->object = object; }; Node *getNext() { return nextNode; }; void setNext(Node *nextNode) { this->nextNode = nextNode; }; private: int object; Node *nextNode; };  http://ecomputernotes.com
  • 15. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List http://ecomputernotes.com
  • 16. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 17. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 18. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 19. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 20. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 21. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 22. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 23. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 24. #include <stdlib.h> #include &quot;Node.cpp&quot; class List { public: // Constructor List() { headNode = new Node(); headNode->setNext(NULL); currentNode = NULL; size = 0; }; C++ Code for Linked List  http://ecomputernotes.com
  • 25. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; }; http://ecomputernotes.com
  • 26. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 27. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 28. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 29. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 30. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 31. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 32. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 33. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 34. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 35. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 36. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 37. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 38. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 39. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 40. C++ Code for Linked List void add(int addObject) { Node* newNode = new Node(); newNode->set(addObject); if( currentNode != NULL ){ newNode->setNext(currentNode->getNext()); currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode; } else { newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode; currentNode = newNode; } size++; };  http://ecomputernotes.com
  • 41. Building a Linked List headNode size=0 List list; http://ecomputernotes.com
  • 42. Building a Linked List headNode 2 headNode currentNode size=1 lastcurrentNode size=0 List list; list.add(2); http://ecomputernotes.com
  • 43. Building a Linked List headNode 2 headNode currentNode size=1 lastcurrentNode 2 6 headNode currentNode size=2 lastcurrentNode size=0 List list; list.add(2); list.add(6); http://ecomputernotes.com
  • 44. Building a Linked List List.add(8); list.add(7); list.add(1); 2 6 7 1 headNode currentNode size=5 lastcurrentNode 8 http://ecomputernotes.com
  • 45. C++ Code for Linked List int get() { if (currentNode != NULL) return currentNode->get(); }; http://ecomputernotes.com
  • 46. C++ Code for Linked List bool next() { if (currentNode == NULL) return false; lastCurrentNode = currentNode; currentNode = currentNode->getNext(); if (currentNode == NULL || size == 0) return false; else return true; }; http://ecomputernotes.com

Editor's Notes

  • #3: End of lecture 2 The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #4: The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #5: The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #6: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #7: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #8: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #9: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #10: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #11: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #12: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #13: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #14: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #15: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #16: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #17: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #18: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #19: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #20: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #21: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #22: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #23: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #24: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #25: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #26: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #27: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #28: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #29: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #30: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #31: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #32: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #33: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #34: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #35: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #36: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #37: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #38: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #39: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #40: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #41: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #42: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #43: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #44: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #45: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #46: The first goal is a worldview to adopt The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.
  • #47: End of lecture 3 The second goal is the “nuts and bolts” of the course. The third goal prepares a student for the future.